Symmetry Breaking Constraints: Recent Results
نویسنده
چکیده
Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: symmetry breaking constraints for row and column symmetry, and symmetry breaking constraints for eliminating value symmetry.
منابع مشابه
Dynamic Symmetry Breaking Constraints
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry breaking constraints, then we post this constraint. We illustrate the method with two examples whe...
متن کاملSymmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. This simple but powerful idea can be used in a number of different ways. We describe one application within model restarts, a search technique desi...
متن کاملEfficient Structural Symmetry Breaking for Constraint Satisfaction Problems
Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various ...
متن کاملSymmetry Breaking and Branching Constraints
Symmetry breaking is the process of eliminating redundant search by taking advantage of the symmetries in a problem. Symmetry breaking techniques can be combined with other search heuristics, such as branching constraints and variable orderings. The interaction between dynamic symmetry breaking and domain splitting is discussed, and preliminary results are presented showing the impact of variab...
متن کاملFoundations of Symmetry Breaking Revisited
Puget’s article “On the Satisfiability of Symmetrical Constraint Satisfaction Problems” [Puget, 1993] is widely acknowledged to be one of the founding papers in symmetry breaking (see for example [Flener et al., 2006; Rossi et al., 2006; Walsh, 2006]). To date, Puget’s definition of a valid reduction seems to be the only common ground that all authors on static symmetry breaking constraints agr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.3348 شماره
صفحات -
تاریخ انتشار 2012